Determinants of Partition Matrices

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partition Regularity of Matrices

This is a survey of results on partition regularity of matrices, beginning with the classic results of Richard Rado on kernel partition regularity, continuing with the groundbreaking results of Walter Deuber on image partition regularity, and leading up to the present day. Included are the largely settled world of finite matrices and the mostly unknown world of infinite matrices.

متن کامل

Multiply partition regular matrices

Let A be a finite matrix with rational entries. We say that A is doubly image partition regular if whenever the set N of positive integers is finitely coloured, there exists ~x such that the entries of A~x are all the same colour (or monochromatic) and also, the entries of ~x are monochromatic. Which matrices are doubly image partition regular? More generally, we say that a pair of matrices (A,...

متن کامل

Determinants and permanents of Hessenberg matrices and generalized Lucas polynomials

In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...

متن کامل

Determinants of Hankel Matrices

The purpose of this paper is to compute asymptotically Hankel determinants for weights that are supported in a semi-infinite interval. The main idea is to reduce the problem to determinants of other operators whose determinant asymptotics are well known.

متن کامل

determinants of adjacency matrices of graphs

we study the set of all determinants of adjacency matrices of graphs with a given number of vertices. using brendan mckay's data base of small graphs, determinants of graphs with at most $9$ vertices are computed so that the number of non-isomorphic graphs with given vertices whose determinants are all equal to a number is exhibited in a table. using an idea of m. newman, it is proved that if $...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 1996

ISSN: 0022-314X

DOI: 10.1006/jnth.1996.0018